Geometric Aliasing, Generalized Deening Relations, and Grr Obner Basis: a New Look at Multi-level Factorial Designs

نویسنده

  • Kenny Q. Ye
چکیده

Multi-level factorial designs are useful in experiments but their aliasing structure are complex compare to two-level fractional factorial designs. A new framework is proposed to study the complex aliasing of those designs. Geometric aliasing is deened for factorial designs. It generalize of the aliasing relation of regular two level fractional fac-torial designs to all factorial designs. Based on geometric aliasing, generalized deening relations are deened for a large group of factorial designs. They determine the complete geometric aliasing structure of a design. The mathematical tools for studying geometric aliasing are available in computational algebraic geometry. Two examples are pre-1 sented to show how this methodology can be used to reveals structure of factorial designs.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Variation of cost functions in integer programming

We study the problem of minimizing c x subject to A x = b, x 0 and x integral, for a xed matrix A. Two cost functions c and c 0 are considered equivalent if they give the same optimal solutions for each b. We construct a polytope St(A) whose normal cones are the equivalence classes. Explicit inequality presentations of these cones are given by the reduced Grr obner bases associated with A. The ...

متن کامل

Polynomial Interpolation of Minimal Degree and Grr Obner Bases

This paper investigates polynomial interpolation with respect to a nite set of appropriate linear functionals and the close relations to the Grr obner basis of the associated nite dimensional ideal.

متن کامل

Relaxation and Hybrid Approaches for Eecient Polynomial Basis Computation on Distributed Memory Machines

Two new approaches to eeciently compute an important polynomial basis (Grr obner basis) on distributed memory machines are presented. The rst approach is based on relaxation of dependencies present in the sequential computation. For the relaxation approach, speculative parallelism is achieved. In the hybrid approach, a Grr obner basis of a set of polynomials is computed in a tree-structured fas...

متن کامل

A Friendly Approach to Studying Aliasing Relations of Mixed Factorials in the Form of Product Arrays

Mixed-level fractional factorial designs are commonly used in industries but its aliasing relations have not been studied in full rigor. These designs take the form of a product array. Aliasing patterns of mixed level factorial designs are discussed here.

متن کامل

Computing Grr Obner Bases by Fglm Techniques in a Noncommutative Setting

A generalization of the FGLM technique is given to compute Grr obner bases for two-sided ideals of free nitely generated algebras. Specializations of this algorithm are presented for the cases in which the ideal is determined by either functionals or monoid (group) presentations. Generalizations are discussed in order to compute G-bases on (twisted) semigroup rings. It is well known that the co...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007